Planning Singularity-Free Paths on Closed-Chain Manipulators

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planning Singularity-free Force-feasible Paths on the Stewart Platform

This paper provides a method for computing force-feasible paths on the Stewart platform. Given two configurations of the platform, the method attempts to connect them through a path that, at any point, allows the platform to counteract any external wrench lying inside a predefined six-dimensional region. In particular, the Jacobian matrix of the manipulator will be full rank along such path, so...

متن کامل

Variational approach for singularity-free path-planning of parallel manipulators

This paper addresses the problem of singularity-free path-planning for parallel manipulators. Unlike in serial manipulators, where there are only boundary singularities, parallel manipulators also possess singular configurations within the workspace where the manipulators are uncontrollable. Therefore, it is imperative that the generated paths are singularity-free. In this paper, we use a varia...

متن کامل

On the Optimal Singularity-Free Trajectory Planning of Parallel Robot Manipulators

Parallel robot manipulators comprise a mobile platform connected to a fixed base through three or more articulated links and are used extensively throughout industry for such diverse applications as high-precision positioning systems, fiber alignment, welding, robotic manipulators, automatic inspection systems, and so forth. Therefore, planning a trajectory to perform a specific task is one of ...

متن کامل

Trajectory Planning of Two Cooperative Mobile Manipulators under Closed-chain and Differential Constraints

In this paper, we consider a new method for trajectory planning of two mobile manipulators for cooperative transportation of a rigid body. The method consists of constructing a graph on a portion of the configuration space that satisfies collision and closure constraints and searching the graph for the shortest possible path using an optimal graph search algorithm. Then, a sequence of time-opti...

متن کامل

Closed loop supply chain planning with vehicle routing

In the recent decade, special attention is paid to reverse logistic due to economic benefits of recovery and recycling of used products as well as environmental legislation and social concerns. On the other hand، many researches claim that separately and sequential planning of forward and reverse logistic causes sub-optimality. Effective transport activities are also one of the most important c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Robotics

سال: 2013

ISSN: 1552-3098,1941-0468

DOI: 10.1109/tro.2013.2260679